n=int(input())
l=list(map(int,input().split(" ")))
s=sum(l)
val=n if s%n==0 else n-1
print(val)
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n ;
cin >> n;
vector<int>v(n);
int sum =0;
for(int i=0; i<n; i++)
{
cin >> v[i] ;
sum += v[i] ;
}
if(sum%n)
cout << n-1 << endl;
else
cout << n << endl;
}
48A - Rock-paper-scissors | 294A - Shaass and Oskols |
1213A - Chips Moving | 490A - Team Olympiad |
233A - Perfect Permutation | 1360A - Minimal Square |
467A - George and Accommodation | 893C - Rumor |
227B - Effective Approach | 1534B - Histogram Ugliness |
1611B - Team Composition Programmers and Mathematicians | 110A - Nearly Lucky Number |
1220B - Multiplication Table | 1644A - Doors and Keys |
1644B - Anti-Fibonacci Permutation | 1610A - Anti Light's Cell Guessing |
349B - Color the Fence | 144A - Arrival of the General |
1106A - Lunar New Year and Cross Counting | 58A - Chat room |
230A - Dragons | 200B - Drinks |
13A - Numbers | 129A - Cookies |
1367B - Even Array | 136A - Presents |
1450A - Avoid Trygub | 327A - Flipping Game |
411A - Password Check | 1520C - Not Adjacent Matrix |